A Hybrid Metaheuristic Solution Method to Traveling Salesman Problem with Drone

The challenging idea of using drones in last-mile delivery systems logistics addresses a new routing problem referred to as the traveling salesman with drone (TSP-D). TSP-D aims construct route deliver parcels set customers by either truck or drone, thereby minimizing operational costs. Since is considered NP-hard, metaheuristics one most promising solutions. This paper presents hybrid metaheuristic solution method based on two state-of-the-art algorithms: genetic algorithm and ant colony optimization algorithm. Heuristics literature are consequent decisions: assignment. Unlike those existing literature, proposed constructs both routes simultaneously. Additionally, best our knowledge, we introduce for first time basis an approach TSP-D. propose binary pheromone framework truck, diverging from traditional structure. Computational experiments indicate that able generate optimal provided instances benchmarking. In addition, improves best-known solutions some found rival heuristics.